Molecular computation: RNA solutions to chess problems

Molecular computation: RNA solutions to chess problems.

We have expanded the field of "DNA computers" to RNA and present a general approach for the solution of satisfiability problems. As an example, we consider a variant of the "Knight problem," which asks generally what configurations of knights can one place on an n x n chess board such that no knight is attacking any other knight on the board. Using specific ribonuclease digestion to manipulate ...

Molecular computation of solutions to combinatorial problems.

The tools of molecular biology were used to solve an instance of the directed Hamiltonian path problem. A small graph was encoded in molecules of DNA, and the "operations" of the computation were performed with standard protocols and enzymes. This experiment demonstrates the feasibility of carrying out computations at the molecular level.

Molecular Computation Of Solutions To

Computation of Nonclassical Solutions to Hamilton-Jacobi Problems

This paper is devoted to the construction of numerical methods for the approximation of nonclassical solutions to multidimensional Hamilton-Jacobi equations, for both scalar and vectorial problems. Recent theoretical results have yielded existence of solutions in many cases for which the usual viscosity approach was ill-suited or not applicable. The selection criterion used here is based on a v...

Common solutions to pseudomonotone equilibrium problems

‎In this paper‎, ‎we propose two iterative methods for finding a common solution of a finite family of equilibrium problems ‎for pseudomonotone bifunctions‎. ‎The first is a parallel hybrid extragradient-cutting algorithm which is extended from the‎ ‎previously known one for variational inequalities to equilibrium problems‎. ‎The second is a new cyclic hybrid‎ ‎extragradient-cutting algorithm‎....